Dependability Assessment using Binary Decision Diagrams (BDDs)
نویسندگان
چکیده
This paper presents the DREDD (Dependability and Risk Evaluation using Decision Diagrams) algorithm which incorporates coverage modeling into a BDD solution of a combinatorial model. BDDs, which do not use cutsets to generate system unreliability, may be used to nd exact solutions for extremely large systems. The DREDD algorithm takes advantage of the e ciency of the BDD solution approach and increases the accuracy of a combinatorial model by including consideration of (possibly) imperfect coverage. The usefulness of combinatorial models, long appreciated for their logical structure and concise representational form, is extended to include many fault tolerant systems previously thought to require more complicated analysis techniques in order to include coverage modeling. In this paper, the DREDD approach is presented and applied to the analysis of two sample systems, the F18 ight control system and a fault tolerant multistage interconnection network.
منابع مشابه
Representations of Multiple-Output Functions Using Binary Decision Diagrams for Characteristic Functions
This paper proposes a method to construct smaller binary decision diagrams for characteristic functions (BDDs for CFs). A BDD for CF represents an n-input m-output function, and evaluates all the outputs in O(n+m) time. We derive an upper bound on the number of nodes of the BDD for CF of n-bit adders (adrn). We also compare complexities of BDDs for CFs with those of shared binary decision diagr...
متن کاملPRISM: Probabilistic Symbolic Model Checker
In this paper we describe PRISM, a tool being developed at the University of Birmingham for the analysis of probabilistic systems. PRISM supports three probabilistic models: discrete-time Markov chains, continuous-time Markov chains and Markov decision processes. Analysis is performed through model checking such systems against specifications written in the probabilistic temporal logics PCTL an...
متن کاملAdvanced Fault Tree Modeling
Fault trees show which joint components' faults mean system faults. Fault trees can often be used to determine dependability parameters of systems. Here it is shown that i) binary decision diagrams (BDDs) can also be used to calculate system mean failure frequency, ii) modeling dynamics of fault trees does not always mean Markov modeling, iii) a deeper understanding of interrelations between s-...
متن کاملDiierential Bdds ?
In this paper, we introduce a class of Binary Decision Diagrams (BDDs) which we call Differential BDDs ( BDDs), and two transformations over BDDs, called Push-up (") and Delta ( ) transformations. In BDDs and its derived classes such as " BDDs or " BDDs, in addition to the ordinary node-sharing in the normal Ordered Binary Decision Diagrams (OBDDs), some isomorphic substructures are collapsed t...
متن کاملReportrapport Resolution and Binary Decision Diagrams Cannot Simulate Each Other Polynomially Resolution and Binary Decision Diagrams Cannot Simulate Each Other Polynomially
There are many di erent ways of proving formulas in proposition logic. Many of these can easily be characterized as forms of resolution (e.g. [12] and [9]). Others use so-called binary decision diagrams (BDDs) [2, 10]. Experimental evidence suggests that BDDs and resolution based techniques are fundamentally di erent, in the sense that their performance can di er very much on benchmarks [14]. I...
متن کامل